Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
نویسندگان
چکیده
We consider the following searching game: there are two players, say Questioner and Responder. Responder chooses a number x ∈ Sn = {1, 2, . . . , n}, Questioner has to find out the number x by asking bi-interval queries and Responder is allowed to lie at most two times throughout the game. The minimal number q(n) of bi-interval queries sufficient to find the unknown integer x is determined for all integers n. This solves completely Rényi–Berlekamp–Ulam searching game with bi-interval queries and two lies, partially solved byMundici and Trombetta. Their solution applied only to the casewhen n is a power of 2. © 2015 Elsevier B.V. All rights reserved.
منابع مشابه
Searching with lies under error cost constraints
The Rényi-Berlekamp-Ulam game is a classical model for the problem of determining the minimum number of queries to find an unknown member in a finite set when up to a finite number of the answers may be erroneous. In the variant considered in this paper, questions with q many possible answers are allowed, further lies are constrained by a bipartite graph with edges weighted by 0, 1, 2, . . . (t...
متن کاملThe Rényi-Ulam pathological liar game with a fixed number of lies
The q-round Rényi-Ulam pathological liar game with k lies on the set [n] := {1, . . . , n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n]\A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi-Ulam liar ga...
متن کاملHow to play the one-lie Rényi-Ulam game
The one-lie Rényi-Ulam liar game is a 2-player perfect information zero sum game, lasting q rounds, on the set [n] := {1, . . . , n}. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n] \ A. Paul wins the regular (resp. pathological) game if after q rounds there is at least one (resp. at most one) element with one or fewer l...
متن کاملProbabilistic Variants of Rényi-ulam Game and Many-valued Logic
In this paper we discuss some generalizations of Rényi-Ulam game with lies: some of them are simply probabilistic variants of it, some others differ from it by the presence of more than one number to guess. In the last part of the paper, we also discuss the relationship between such variants and many-valued logic. This paper is just a survey of known results, but in its last part it also contai...
متن کاملTwo-batch liar games on a general bounded channel
We consider an extension of the 2-person Rényi-Ulam liar game in which lies are governed by a channel C, a set of allowable lie strings of maximum length k. Carole selects x ∈ [n], and Paul makes t-ary queries to uniquely determine x. In each of q rounds, Paul weakly partitions [n] = A0∪· · ·∪At−1 and asks for a such that x ∈ Aa. Carole responds with some b, and if a 6= b, then x accumulates a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 202 شماره
صفحات -
تاریخ انتشار 2016